#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n;
int a[N];
int main() {
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
    }
    sort(a + 1, a + 1 + n);
    int pre = 1;
    for (int i = 1; i <= n; i++) {
        pre = upper_bound(a + pre + 1, a + n + 1, a[i]) - a;
        if (pre >= n) {
            printf("%d", n - i);
            break;
        }
    }
    return 0;
}